Maximin, minimax, and composite sequential machines
نویسندگان
چکیده
منابع مشابه
Minimal Sequential Interaction Machines
Persistent Turing Machines PTMs are an abstract model for sequential interactive comput ing marrying coinductive semantics with e ective constructibility They are multitape machines with work tape contents preserved between interactions whose behavior is characterized obser vationally by input output streams Notions of PTM equivalence and expressiveness have been studied proving that in non alg...
متن کاملSequential Minimax Search for a Maximum
The problem formulated below was motivated by that of determining an interval containing the point at which a unimodal function on the unit interval possesses a maximum, without postulating regularity conditions involving continuity, derivatives, etc. Our solution is to give, for every e > 0 and every specified number N of values of the argument at which the function may be observed, a procedur...
متن کاملSequential Support Vector Machines
In this paper, we derive an algorithm to train support vector machines sequentially. The algorithm makes use of the Kalman lter and is optimal in a minimum variance framework. It extends the support vector machine paradigm to applications involving real-time and non-stationary signal processing. It also provides a computationally eecient alternative to the problem of quadratic optimisation.
متن کاملSequential scheduling on identical machines
We study a sequential version of the well-known KP-model: Each of n agents has a job that needs to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the finish time of his machine. We study the corresponding sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insig...
متن کاملEvaluation of Support Vector Machines and Minimax Probability Machines for Weather Prediction
The paper evaluates two kernel-based methods on the problem of predicting precipitation based on observable variables. The support vector machine (SVM) method finds the two parallel hyperplanes that provide maximal separation of two subsets, excepting outliers. The minimax probability machine (MPM) method finds an optimal separating hyperplane that minimizes the probability of misclassification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1968
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90026-7